Kernel aggregated fast multipole method

نویسندگان

چکیده

Many different simulation methods for Stokes flow problems involve a common computationally intense task -- the summation of kernel function over $O(N^2)$ pairs points. One popular technique is Kernel Independent Fast Multipole Method (KIFMM), which constructs spatial adaptive octree all points and places small number equivalent multipole local around each box, completes sum with $O(N)$ cost, using these Simpler kernels can be used between to improve efficiency KIFMM. Here we present further extensions applications this idea, enable efficient summations flexible boundary conditions various kernels. We call our method Aggregated (KAFMM), because it uses functions at stages traversal. have implemented as an open-source software library STKFMM based on high performance PVFMM, support Laplace kernels, Stokeslet, regularized Rotne-Prager-Yamakawa (RPY) tensor, double-layer traction operators. Open periodic are supported no-slip wall condition Stokeslet RPY tensor. The package designed ready-to-use well being readily extensible additional

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fourier-series-based kernel-independent fast multipole method

We present in this paper a new kernel-independent fast multipole method (FMM), named as FKI-FMM, for pairwise particle interactions with translation-invariant kernel functions. FKI-FMM creates, using numerical techniques, sufficiently accurate and compressive representations of a given kernel function over multi-scale interaction regions in the form of a truncated Fourier series. It provides al...

متن کامل

An Accelerated Kernel-Independent Fast Multipole Method in One Dimension

A version of the fast multipole method (FMM) is described for charge distributions on the line. Previously published schemes of this type relied either on analytical representations of the potentials to be evaluated (multipoles, Legendre expansions, Taylor series, etc.) or on tailored representations that were constructed numerically (using, e.g., the singular value decomposition (SVD), artific...

متن کامل

Generalized fast multipole method

The fast multipole method (FMM) is a technique allowing the fast calculation of long-range interactions between N points in O(N) or O(N lnN) steps with some prescribed error tolerance. The FMM has found many applications in the field of integral equations and boundary element methods, in particular by accelerating the solution of dense linear systems arising from such formulations. Original FMM...

متن کامل

A kernel-independent fast multipole algorithm

We present a new fast multipole method for particle simulations. The main feature of our algorithm is that is kernel independent, in the sense that no analytic expansions are used to represent the far field. Instead we use equivalent densities, which we compute by solving small Dirichlet-type boundary value problems. The translations from the sources to the induced potentials are accelerated by...

متن کامل

The Inverse Fast Multipole Method

This article introduces a new fast direct solver for linear systems arising out of wide range of applications, integral equations, multivariate statistics, radial basis interpolation, etc., to name a few. The highlight of this new fast direct solver is that the solver scales linearly in the number of unknowns in all dimensions. The solver, termed as Inverse Fast Multipole Method (abbreviated as...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Advances in Computational Mathematics

سال: 2021

ISSN: ['1019-7168', '1572-9044']

DOI: https://doi.org/10.1007/s10444-021-09896-1